Efficient and Secure Top-k Query Processing on Hybrid Sensed Data
نویسندگان
چکیده
منابع مشابه
Secure Top-k Query Processing on Encrypted Databases
Privacy concerns in outsourced cloud databases have become more and more important recentlyand many efficient and scalable query processing methods over encrypted data have been proposed.However, there is very limited work on how to securely process top-k ranking queries over encrypteddatabases in the cloud. In this paper, we focus exactly on this problem: secure and efficient proce...
متن کاملTop-k Linked Data Query Processing
In recent years, top-k query processing has attracted much attention in large-scale scenarios, where computing only the k “best” results is often sufficient. One line of research targets the so-called top-k join problem, where the k best final results are obtained through joining partial results. In this paper, we study the top-k join problem in a Linked Data setting, where partial results are ...
متن کاملSecure Top-k Query Processing in Unattended Tiered Sensor Networks
Many future large-scale unattended sensor networks (USNs) are expected to follow a two-tier architecture with resource-poor sensor nodes at the lower tier and fewer resourcerich master nodes at the upper tier. Master nodes collect data from sensor nodes and then answer the queries from the network owner on their behalf. In hostile environments, master and sensor nodes may be compromised by the ...
متن کاملEfficient Top - K Query Processing in P 2 P Networks
Top-k query is widely used in the search engine and gains great success, which perform the cooperative query by aggregating the database objects’ degree of match for each different query predicate and returning the best k matching objects only. It’s also applied to p2p file-sharing systems. However, top-k query processing in p2p systems is very challenging because the potentially large number o...
متن کاملEfficient Early Top-k Query Processing in Overloaded P2P Systems
Top-k query processing in P2P systems has focused on efficiently computing the top-k results while reducing network traffic and query response time. However, in overloaded P2P systems (with very high query loads), some peers may take a long time to answer, thus making the user wait a long time to obtain the final top-k result. In this paper, we address this problem, which we reformulate as earl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mobile Information Systems
سال: 2016
ISSN: 1574-017X,1875-905X
DOI: 10.1155/2016/1685054